搜索资源列表
code
- 回溯法求01背包问题,c语言版本，由于时间关系没有将代码进行很好的整理，所有代码都在一个文件中
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
huisufa
- 使用回溯法解决01背包问题，适合于算法分析与设计的初学者-Use backtracking to solve 01 knapsack problem, algorithm analysis and design is suitable for beginners
01bag
- 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
a
- 为了方便大家更好的学习算法分析，我上传了一个用回溯法解决的01背包问题-In order to facilitate a better learning algorithm all analysis, I uploaded a backtracking method to deal with the 01 knapsack problem
01knapsackproblem
- 回溯法解决01背包问题，是在标准C++上运行的代码，故在VC++上也能运行良好！-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
0_1bag
- 此程序是用回溯法解决01背包问题，可以运行成功，欢迎下载-This program is backtracking to solve 01 knapsack problem, you can run successfully, please download
KnapsackBTDP
- C#实现动态规划法和回溯法解决01背包问题-C# dynamic programming and backtracking to solve knapsack problem 01
huisu01beibaorar
- 算法分析中以回溯法实现的01背包问题，附有完整的运行说明-Backtracking algorithm analysis in order to achieve the 01 knapsack problem, with complete operating instructions
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
01
- 利用回溯法求01背包问题,包含了很多内容-it is good
knap-error
- 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
TSPandBAGproblem
- 包里包含五个文件，其中ASforTSP是用蚂蚁算法解决TSP问题，Backtrack是用回溯法解决01背包问题，GAO是用遗传算法解决TSP，GreedySelector是用贪心算法解决01背包问题，MoneyChange是金额的数字与汉字的转换方案，本人作为一个学生初学编程，希望多多包涵。-Package contains five files, which ASforTSP ant algorithm to solve TSP is the problem, Backtrack 01 is
Knap
- 采用回溯法解决01背包问题，数据输入为当前目录下的data.txt文件；-Backtracking to solve knapsack problem 01, data input data.txt file in the current directory
01backpack
- 用回溯法解决01背包问题，C++实现，通过读取data.txt文件得到背包容量和物品信息，下载文件后直接导入运行即可。-Backtracking to solve knapsack problem 01, C++ implementation, read the data.txt file the backpack capacity and items of information, to download the file directly import can be run.
01bag
- 01 背包问题，c语言实现，计算机算法分析实习，使用的回溯法-01 knapsack problem, the C language, the computer algorithm analysis internship backtracking
01
- 01背包问题简单的回溯法实现，可供新人学习和参考使用。-01 knapsack problem to achieve a simple backtracking available new learning and reference.
回溯法（01背包问题）
- 回溯法解决01背包问题，111111111111111111(Backtracking method for solving 01 knapsack problems)